On Plane Constrained Bounded-Degree Spanners

نویسندگان

  • Prosenjit Bose
  • Rolf Fagerberg
  • André van Renssen
  • Sander Verdonschot
چکیده

Let P be a finite set of points in the plane and S a set of non-crossing line segments with endpoints in P . The visibility graph of P with respect to S, denoted Vis(P, S), has vertex set P and an edge for each pair of vertices u, v in P for which no line segment of S properly intersects uv. We show that the constrained half-θ6-graph (which is identical to the constrained Delaunay graph whose empty visible region is an equilateral triangle) is a plane 2-spanner of Vis(P, S). We then show how to construct a plane 6-spanner of Vis(P, S) with maximum degree 6 + c, where c is the maximum number of segments of S incident to a vertex.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Spanners and Lightweight Spanners of Geometric Graphs

We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...

متن کامل

On Geometric Spanners of Euclidean Graphs and their Applications in Wireless Networks

We consider the problem of constructing a bounded-degree planar geometric spanner for a unit disk graph modeling a wireless network. The related problem of constructing a planar geometric spanner of a Euclidean graph has been extensively studied in the literature. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor ; however, its degree may not be bound...

متن کامل

Competitive Routing on a Bounded-Degree Plane Spanner

We show that it is possible to route locally and competitively on two bounded-degree plane 6-spanners, one with maximum degree 12 and the other with maximum degree 9. Both spanners are subgraphs of the empty equilateral triangle Delaunay triangulation. First, in a weak routing model where the only information stored at each vertex is its neighbourhood, we show how to find a path between any two...

متن کامل

On bounded degree plane strong geometric spanners

Article history: Received 13 October 2010 Received in revised form 18 March 2012 Accepted 19 March 2012 Available online xxxx

متن کامل

Bounded Degree Planar Geometric Spanners

Given a set P of n points in the plane, we show how to compute in O(n logn) time a subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong planar t-spanner of P with t = (1 + √ 2) ∗ δ, where δ is the spanning ratio of the Delaunay triangulation. Furthermore, given a Delaunay triangulation, we show a distributed algorithm that computes the same bounded degree planar sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012